Analytic Delineation of Thiessen Polygons*
نویسندگان
چکیده
منابع مشابه
Real-time Forecasting Method of Urban Air Quality Based on Observation Sites and Thiessen Polygons
This paper proposes a real-time urban air quality forecasting method based on monitoring sites and Thiessen polygon. Firstly, the concentration of pollutants affecting air quality is obtained through the real-time observations of the monitoring sites deployed in wireless sensor network, according to which the air quality index (AQI) can be calculated and air quality levels and categories can be...
متن کاملAutomated Thiessen polygon generation
[1] Data uncertainty research of rain gauge network requires generation of large numbers of Thiessen polygons. Despite its importance in hydrology, few studies on computational Thiessen polygons have been carried out, and there is little published information in the hydrological literature. This paper describes two automated approaches and the ways for their implementation in hydrological appli...
متن کاملAnalytic Regularity for Linear Elliptic Systems in Polygons and Polyhedra
We prove weighted anisotropic analytic estimates for solutions of second order elliptic boundary value problems in polyhedra. The weighted analytic classes which we use are the same as those introduced by Guo in 1993 in view of establishing exponential convergence for hp finite element methods in polyhedra. We first give a simple proof of the known weighted analytic regularity in a polygon, rel...
متن کاملDelineation of Vegetation and Building Polygons from Full- Waveform Airborne Lidar Data Using Opals Software
Full-waveform LiDAR is an active remote sensing technique that provides the scattering properties of the targets i.e. amplitude and echo width (EW) in addition to 3D point clouds. The amplitude provides information on the target's reflectance and the EW is a measure for the range variation of scatterers within the laser footprint contributing to a single echo and is, therefore, an indicator for...
متن کاملConvexity of Sub-polygons of Convex Polygons
A convex polygon is defined as a sequence (V0, . . . , Vn−1) of points on a plane such that the union of the edges [V0, V1], . . . , [Vn−2, Vn−1], [Vn−1, V0] coincides with the boundary of the convex hull of the set of vertices {V0, . . . , Vn−1}. It is proved that all sub-polygons of any convex polygon with distinct vertices are convex. It is also proved that, if all sub-(n − 1)-gons of an n-g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Geographical Analysis
سال: 2010
ISSN: 0016-7363
DOI: 10.1111/j.1538-4632.1973.tb01003.x